THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
نویسندگان
چکیده
منابع مشابه
Kinetic and Stationary Point-Set Embeddability for Plane Graphs
We investigate a kinetic version of point-set embeddability. Given a plane graph G(V,E) where |V | = n, and a set P of n moving points where the trajectory of each point is an algebraic function of constant maximum degree s, we maintain a point-set embedding of G on P with at most three bends per edge during the motion. This requires reassigning the mapping of vertices to points from time to ti...
متن کاملImproved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees
In the point set embeddability problem, we are given a plane graph G with n vertices and a point set S with n points. Now the goal is to answer the question whether there exists a straight-line drawing of G such that each vertex is represented as a distinct point of S as well as to provide an embedding if one does exist. Recently, in [15], a complete characterization for this problem on a speci...
متن کاملUpward Point-Set Embeddability
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of k-switch trees, that is a generalization of switch trees (according to this definition a switch t...
متن کاملk-colored Point-set Embeddability of Outerplanar Graphs
This paper addresses the problem of designing drawing algorithms that receive as input a planar graph G, a partitioning of the vertices of G into k different semantic categories V0, · · · , Vk−1, and k disjoint sets S0, · · · , Sk−1 of points in the plane with |Vi| = |Si| (i ∈ {0, · · · , k − 1}). The desired output is a planar drawing such that the vertices of Vi are mapped onto the points of ...
متن کاملOn upward point set embeddability
Article history: Received 8 September 2011 Accepted 23 November 2012 Available online 27 November 2012 Communicated by D. Wagner
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2013
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195913600091